KEISLER’S ORDER IS NOT LINEAR, ASSUMING A SUPERCOMPACT
نویسندگان
چکیده
منابع مشابه
Planar Graph Coloring is not Self-Reducible, Assuming P != NP
We show that obtaining the lexicographically first four coloring of a planar graph is NP–hard. This shows that planar graph four-coloring is not self-reducible, assuming P 6= NP . One consequence of our result is that the schema of [JVV 86] cannot be used for approximately counting the number of four colorings of a planar graph. These results extend to planar graph k-coloring, for k ≥ 4. Resear...
متن کاملIs Linear Order Derived?
The paper casts a critical eye on those dependency grammars (DGs) that view linear order as derived from hierarchical order. It argues that MTT is such a DG insofar as language synthesis begins with a semantic representation, progresses through syntactic representations that lack linear order, and then proceeds to the morphological and phonological representations that include linear order. The...
متن کاملDiagonal Supercompact Radin Forcing
In this paper we consider two methods for producing models with some global behavior of the continuum function on singular cardinals and the failure of weak square. The first method is as an extension of Sinapova’s work [21]. We define a diagonal supercompact Radin forcing which adds a club subset to a cardinal κ while forcing the failure of SCH everywhere on the club. The intuition from Sinapo...
متن کاملStroke in MELAS is a Vasogenic Edema and Not Ischemic
We read with interest the article by Almasi et al. on a 48 years old female patient with Mitochondrial Encephalomyopathy, Lactic Acidosis, And Stroke-like episodes (MELAS), diagnosed based on the clinical presentation, blood test results, and imaging and muscle biopsy findings . We have the following comments and concerns.
متن کاملLinear Higher-Order Matching Is NP-Complete
We consider the problem of higher-order matching restricted to the set of linear λ-terms (i.e., λ-terms where each abstraction λx.M is such that there is exactly one free occurrence of x in M). We prove that this problem is decidable by showing that it belongs to NP. Then we prove that this problem is in fact NP-complete. Finally, we discuss some heuristics for a practical algorithm.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Symbolic Logic
سال: 2018
ISSN: 0022-4812,1943-5886
DOI: 10.1017/jsl.2018.1